On the weight distributions of optimal cosets of the first-order Reed-Muller codes

نویسنده

  • Anne Canteaut
چکیده

We study the weight distributions of cosets of the first-order Reed–Muller code (1 ) for odd , whose minimum weight is greater than or equal to the so-called quadratic bound. Some general restrictions on the weight distribution of a coset of (1 ) are obtained by partitioning its words according to their weight divisibility. Most notably, we show that there are exactly five weight distributions for optimal cosets of (1 7) in (5 7) and that these distributions are related to the degree of the function generating the coset. Moreover, for any odd 9, we exhibit optimal cubic cosets of (1 ) whose weights take on exactly five values.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Some Cosets of the First-Order Reed-Muller Code with High Minimum Weight

We study a family of particular cosets of the first-order Reed–Muller code R(1;m): those generated by special codewords, the idempotents. Thus we obtain new maximal weight distributions of cosets of R(1; 7) and 84 distinct almost maximal weight distributions of cosets of R(1; 9), that is, with minimum weight 240. This leads to crypotographic applications in the context of stream ciphers.

متن کامل

Orphan structure of the first-order Reed-Muller codes

Brualdi, R.A., N. Cai and VS. Pless, Orphan structure of the first-order Reed-Muller codes, Discrete Mathematics 102 (1991) 239-247. We investigate a method of combining two codes which we call the outer product. First-order Reed-Muller codes are outer products of a number of copies of the full binary space of length 2, and we apply our results to obtain cosets of the Reed-Muller codes which ha...

متن کامل

On cryptographic properties of the cosets of R(1, m)

We introduce a new approach for the study of weight distributions of cosets of the Reed–Muller code of order 1. Our approach is based on the method introduced by Kasami in [1], using Pless identities. By interpreting some equations, we obtain a necessary condition for a coset to have a “high” minimum weight. Most notably, we are able to distinguish such cosets which have three weights only. We ...

متن کامل

Complete Mutually Orthogonal Golay Complementary Sets From Reed-Muller Codes

Recently Golay complementary sets were shown to exist in the subsets of second-order cosets of a q-ary generalization of the first-order Reed–Muller (RM) code. We show that mutually orthogonal Golay complementary sets can also be directly constructed from second-order cosets of a q-ary generalization of the first-order RM code. This identification can be used to construct zero correlation zone ...

متن کامل

Coset Analysis of Reed Muller Codes Via Translates of Finite Vector Spaces

In order to calculate the error probability of a code it is necessary to know the distribution of the coset leaders. The enumeration of cosets of the first order Reed Muller code has been studied (i) by Berlekamp and Welch (1972) by associating with each coset a class of Boolean functions, and (ii) by Sloane and Dick (1971) by associating with each coset a class of single-error-correcting codes...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 47  شماره 

صفحات  -

تاریخ انتشار 2001